THE FAST SINC TRANSFORM AND IMAGE RECONSTRUCTION FROM NONUNIFORM SAMPLES IN k-SPACE
نویسندگان
چکیده
A number of problems in image reconstruction and image processing can be addressed, in principle, using the sinc kernel. Since the sinc kernel decays slowly, however, it is generally avoided in favor of some more local but less precise choice. In this paper, we describe the fast sinc transform, an algorithm which computes the convolution of arbitrarily spaced data with the sinc kernel in O.N log N / operations, where N denotes the number of data points. We briefly discuss its application to the construction of optimal density compensation weights for Fourier reconstruction and to the iterative approximation of the pseudoinverse of the signal equation in MRI.
منابع مشابه
Direct reconstruction of non-Cartesian k-space data using a nonuniform fast Fourier transform.
An algorithm of Dutt and Rokhlin (SIAM J Sci Comput 1993;14:1368-1383) for the computation of a fast Fourier transform (FFT) of nonuniformly-spaced data samples has been extended to two dimensions for application to MRI image reconstruction. The 2D nonuniform or generalized FFT (GFFT) was applied to the reconstruction of simulated MRI data collected on radially oriented sinusoidal excursions in...
متن کاملImproving Non-Cartesian MRI Reconstruction through Discontinuity Subtraction
Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesian k-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these probl...
متن کاملFast, iterative, field-corrected image reconstruction for MRI
Magnetic field inhomogeneities cause distortions in the reconstructed images for non-cartesian k-space MRI (using spirals, for example). Several noniterative methods are currently used to compensate for the off-resonance during the reconstruction, but these methods rely on the assumption of a smoothly varying field map. Recently, iterative methods have been proposed that do not rely on this ass...
متن کاملMR Image Reconstruction from Sparse Radial Samples Using Bregman Iteration
T-C. Chang, L. He, T. Fang Siemens Corporate Research, Inc., Princeton, NJ, United States, Department of Mathematics, UCLA, Los Angeles, CA, United States Introduction Many applications in magnetic resonance imaging (MRI) require very short scan time while the image reconstruction can be performed off-line. To this end, during the scanning process it is necessary to sample the frequency plane (...
متن کاملFast DCT-based image convolution algorithms and application to image resampling and hologram reconstruction
Convolution and correlation are very basic image processing operations with numerous applications ranging from image restoration to target detection to image resampling and geometrical transformation. In real time applications, the crucial issue is the processing speed, which implies mandatory use of algorithms with the lowest possible computational complexity. Fast image convolution and correl...
متن کامل